High Accuracy Homography Computation without Iterations

نویسندگان

  • Hirotaka Niitsuma
  • Prasanna Rangarajan
  • Kenichi Kanatani
چکیده

We present a highly accurate least-squares (LS) alternative to the theoretically optimal maximum likelihood (ML) estimator for homographies between two images. Unlike ML, our estimator is non-iterative and yields a solution even in the presence of large noise. By rigorous error analysis, we derive a “hyperLS” estimator which is unbiased up to second order noise terms. We also introduce a computational simplification, which we call “Taubin approximation”, without incurring an accuracy loss. We experimentally demonstrate that our estimator far surpasses the standard LS and is nearly comparable to the ML and the theoretical accuracy limit (the KCR lower bound).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hyperaccurate Correction of Maximum Likelihood for Geometric Estimation

Abstract: The best known method for optimally computing parameters from noisy data based on geometric constraints is maximum likelihood (ML). This paper reinvestigates “hyperaccurate correction” for further improving the accuracy of ML. In the past, only the case of a single scalar constraint was studied. In this paper, we extend it to multiple constraints given in the form of vector equations....

متن کامل

FATHALLA, VOGIATZIS: MULTI-MODEL FITTING BASED ON MINIMUM SPANNING TREE1 Multi-model fitting based on Minimum Spanning Tree

This paper presents a novel approach to the computation of primitive geometrical structures, where no prior knowledge about the visual scene is available and a high level of noise is expected. We based our work on the grouping principles of proximity and similarity, of points and preliminary models. The former was realized using Minimum Spanning Trees (MST), on which we apply a stable alignment...

متن کامل

Accuracy Bounds and Optimal Computation of Homography for Image Mosaicing Applications

We describe a theoretically optimal algorithm for computing the homography between two images in relation to image mosaicing applications. First, we derive a theoretical accuracy bound based on a mathematical model of image noise and do simulation to con rm that our renormalization technique e ectively attains that bound; our algorithm is optimal in that sense. Then, we apply our technique to m...

متن کامل

Enhanced Algorithm for Obstacle Detection and Avoidance Using a Hybrid of Plane To Plane Homography, Image Segmentation, Corner and Edge Detection Techniques

N.A. Ofodile 1 , S. M. Sani 2 PhD, MSc(Eng), BSc(Hons)Eng 1 (NAF Research and Development Centre, Air Force Institute of Technology, Nigeria) 2 (Department of Electrical and Electronics Engineering, Nigerian Defence Academy, Nigeria) _____________________________________________________________________________________ Abstract: This paper presents the implementation as well as simulated results...

متن کامل

Evaluating error of homography

In this paper, an exact computation of the geometric error for homography is derived. We assume the Gaussian noise model for the perturbation of image coordinates and formulate the problem as a least squares minimization. This paper shows how to compute accurate geometric error through solving a polynomial of degree eight. This approach avoids falling into local minima that may occur when itera...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010